Graph choosability and double list colorability
نویسندگان
چکیده
منابع مشابه
Graph Choosability and Double List Colorability
In this paper, we give a sufficient condition for graph choosability, based on Combinatorial Nullstellensatz and a specific property, called “double list colorability”, which means that there is a list assignment for which there are exactly two admissible colorings.
متن کاملComplexity of unique list colorability
Given a list L(v) for each vertex v, we say that the graph G is L-colorable if there is a proper vertex coloring of G where each vertex v takes its color from L(v). The graph is uniquely k-list colorable if there is a list assignment L such that |L(v)| = k for every vertex v and the graph has exactly one L-coloring with these lists. Mahdian and Mahmoodian [MM99] gave a polynomial-time character...
متن کاملExtended core and choosability of a graph
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence between the (a, b)-choosability of a graph and the (a, b)-choosability of one of its subgraphs called the extended core. As an application, this result allows to prove th...
متن کاملInterpreting Graph Colorability in Finite Semigroups
We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2010
ISSN: 1232-9274
DOI: 10.7494/opmath.2010.30.3.271